Search results for "Mathematical proof"
showing 10 items of 61 documents
Stability of stationary solutions in models of the Calvin cycle
2017
Abstract In this paper results are obtained concerning the number of positive stationary solutions in simple models of the Calvin cycle of photosynthesis and the stability of these solutions. It is proved that there are open sets of parameters in the model of Zhu et al. (2009) for which there exist two positive stationary solutions. There are never more than two isolated positive stationary solutions but under certain explicit special conditions on the parameters there is a whole continuum of positive stationary solutions. It is also shown that in the set of parameter values for which two isolated positive stationary solutions exist there is an open subset where one of the solutions is asym…
Kollineationen und Schliessungssätze für Ebene Faserungen
1979
Every affine central collineation of a translation plane π induces a special collineation of the projective space π spanned by the spreadF belonging to π. Here the relations between these special collineations of π and certain incidence propositions inF are investigated; so new proofs are given for some characterisations of (A,B)-regular spreads included in [7].
Are locally finite MV-algebras a variety?
2021
We answer Mundici's problem number 3 (D. Mundici. Advanced {\L}ukasiewicz calculus. Trends in Logic Vol. 35. Springer 2011, p. 235): Is the category of locally finite MV-algebras equivalent to an equational class? We prove: (i) The category of locally finite MV-algebras is not equivalent to any finitary variety. (ii) More is true: the category of locally finite MV-algebras is not equivalent to any finitely-sorted finitary quasi-variety. (iii) The category of locally finite MV-algebras is equivalent to an infinitary variety; with operations of at most countable arity. (iv) The category of locally finite MV-algebras is equivalent to a countably-sorted finitary variety. Our proofs rest upon th…
A simple proof of the polylog counting ability of first-order logic
2007
The counting ability of weak formalisms (e.g., determining the number of 1's in a string of length N ) is of interest as a measure of their expressive power, and also resorts to complexity-theoretic motivations: the more we can count the closer we get to real computing power. The question was investigated in several papers in complexity theory and in weak arithmetic around 1985. In each case, the considered formalism (AC 0 -circuits, first-order logic, Δ 0 ) was shown to be able to count up to a polylogarithmic number. An essential part of the proofs is the construction of a 1-1 mapping from a small subset of {0, ..., N - 1} into a small initial segment. In each case the expressibility of …
The McKay conjecture and Galois automorphisms
2004
The main problem of representation theory of finite groups is to find proofs of several conjectures stating that certain global invariants of a finite group G can be computed locally. The simplest of these conjectures is the ?McKay conjecture? which asserts that the number of irreducible complex characters of G of degree not divisible by p is the same if computed in a p-Sylow normalizer of G. In this paper, we propose a much stronger version of this conjecture which deals with Galois automorphisms. In fact, the same idea can be applied to the celebrated Alperin and Dade conjectures.
Descriptive Complexity, Lower Bounds and Linear Time
1999
This paper surveys two related lines of research: Logical characterizations of (non-deterministic) linear time complexity classes, and non-expressibility results concerning sublogics of existential second-order logic. Starting from Fagin’s fundamental work there has been steady progress in both fields with the effect that the weakest logics that are used in characterizations of linear time complexity classes are closely related to the strongest logics for which inexpressibility proofs for concrete problems have been obtained. The paper sketches these developments and highlights their connections as well as the obstacles that prevent us from closing the remaining gap between both kinds of lo…
Using the Theory of Regular Functions to Formally Prove the ε-Optimality of Discretized Pursuit Learning Algorithms
2014
Learning Automata LA can be reckoned to be the founding algorithms on which the field of Reinforcement Learning has been built. Among the families of LA, Estimator Algorithms EAs are certainly the fastest, and of these, the family of Pursuit Algorithms PAs are the pioneering work. It has recently been reported that the previous proofs for e-optimality for all the reported algorithms in the family of PAs have been flawed. We applaud the researchers who discovered this flaw, and who further proceeded to rectify the proof for the Continuous Pursuit Algorithm CPA. The latter proof, though requires the learning parameter to be continuously changing, is, to the best of our knowledge, the current …
La demostración matemática: problemática actual
2002
RESUMENAnalizamos la problemática actual en torno a la demostración matemática, con particular énfasis en las ideas introducidas por las demostraciones asistidas por ordenador y por la llamada matemática experimental. Examinamos además la influencia que pueden tener estas ideas sobre el concepto de demostración y proponemos una caracterización atendiendo a las diferentes funciones que puede desempeñar la demostración en su vertientes explicativa, comunicativa, sistematizadora, como incrementadora de la comprensión de resultados y como transmisora de conocimiento y convicción. Finalmente, se ofrecen algunas conclusiones sobre problemas relacionados con la intuición, la lógica, la certeza, el…
On the Existence of 1-Bounded Bi-ideals with the WELLDOC Property
2015
A combinatorial condition called well distributedoccurrences, or WELLDOC for short, has been introducedrecently. The proofs that WELLDOC property holds for thefamily of Sturmian words, and more generally, for Arnoux-Rauzy words are given in two papers by Balkova et al. The WELLDOC property for bounded bi-ideals is analysed inthis paper. The existence of a 1-bounded bi-ideal over thefinite alphabet that satisfies the WELLDOC property has beenproved by the authors.
Lehmer code transforms and Mahonian statistics on permutations
2012
Abstract In 2000 Babson and Steingrimsson introduced the notion of vincular patterns in permutations. They show that essentially all well-known Mahonian permutation statistics can be written as combinations of such patterns. Also, they proved and conjectured that other combinations of vincular patterns are still Mahonian. These conjectures were proved later: by Foata and Zeilberger in 2001, and by Foata and Randrianarivony in 2006. In this paper we give an alternative proof of some of these results. Our approach is based on permutation codes which, like the Lehmer code, map bijectively permutations onto subexcedant sequences. More precisely, we give several code transforms (i.e., bijections…